Bounding queries in the analytic polynomial-time hierarchy
نویسندگان
چکیده
منابع مشابه
Bounding Queries in the Analytic Polynomial-Time Hierarchy
In a previous paper the present authors [4] investigated an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP results which can be expressed by set quantifiers with a bounded number of queries motivated us to ...
متن کاملThe Analytic Polynomial Time Hierarchy
Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following classes: pk, pk (k 0), PSPACE, exp k ...
متن کاملSQL Can Maintain Polynomial-Hierarchy Queries
1 Summary Let us introduce the concept of an incremental evaluation system, or IES, discussed in 15]. Suppose we have a query Q : S ! T. An IES(L) for maintaining the query Q is a system consisting of input database I, an answer database A, an optional auxiliary database, and a nite set of \update" functions that correspond to the diierent kinds of permissible update to the input database. Thes...
متن کاملRelational Queries Computable in Polynomial Time
We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point operator and a total ordering on the universe We also show that even without the ordering one application of xed point su ces to express any query expressible with several alternations of xed point and negation This proves that the xed point query hierarchy suggested by Cha...
متن کاملThe Minimal Bounding Volume Hierarchy
Bounding volume hierarchies (BVH) are a commonly used method for speeding up ray tracing. Even though the memory footprint of a BVH is relatively low compared to other acceleration data structures, they still can consume a large amount of memory for complex scenes and exceed the memory bounds of the host system. This can lead to a tremendous performance decrease on the order of several magnitud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00057-7